new ant colony algorithm method based on mutation for fpga placement problem

Authors

setareh shafaghi

fardad farokhi

reza sabbaghi-nadooshan

abstract

many real world problems can be modelled as an optimization problem. evolutionary algorithms are used to solve these problems. ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. these ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. ant colony optimization uses a similar mechanism to solve the optimization problem. usually the main difficulties of evolutionary algorithm for solving the optimization problem are: early convergence, loss of population diversity, and placing in a local minimum .therefore, it needs the way that preserves the variation and tries to avoid trapping in local minimum. in this paper by combining ant colony algorithm and mutation hybrid algorithms that leads to the better solution for optimization of fpga (field programmable gate array) placement problem is made. they are different types of swarm intelligence algorithm. after designing the algorithm, its parameters tuning have been done by solving several problems, and then the proposed methods have been compared with the other approaches. the results show that in most problems, the proposed hybrid method is able to obtain better solutions and makes fewer errors.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

full text

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

full text

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

full text

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

full text

Population based ant colony optimization on FPGA

We propose to modify a type of ant algorithm called Population based Ant Colony Optimization (P-ACO) to allow implementation on an FPGA architecture. Ant algorithms are adapted from the natural behavior of ants and used to find good solutions to combinatorial optimization problems. General layout on the FPGA and algorithmic description are covered. The most notable achievements featured in this...

full text

Min-max Vehicle Routing Problem Based on Ant Colony Algorithm

To minimize the length of travelling distance of the longest sub-route in vehicle routing problem, the max-min ant system with parameter adaptation is adopted, which can be applied to different datasets in practice. Routes are constructed by sequential and parallel methods for the customers with clustering and random distribution respectively. Since the behavior of ant colony algorithm depends ...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of smart electrical engineering

Publisher: islamic azad university,central tehran branch

ISSN 2251-9246

volume 02

issue 1 2013

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023